CBase-EC: Achieving Optimal Throughput-Storage Efficiency Trade-Off Using Erasure Codes
نویسندگان
چکیده
منابع مشابه
Hierarchical codes: A flexible trade-off for erasure codes in peer-to-peer storage systems
Redundancy is the basic technique to provide reliability in storage systems consisting of multiple components. A redundancy scheme defines how the redundant data are produced and maintained. The simplest redundancy scheme is replication, which however suffers from storage inefficiency. Another approach is erasure coding, which provides the same level of reliability as replication using a signif...
متن کاملOptimal Trade-off Between Energy Efficiency and Average Delay
In wireless networks consisting of sensors and mobile devices, battery power is a severe resource constraint. Energyefficient communication techniques are therefore crucial to the long-term survivability of the network. In communication theory, it is well known that for a bandlimited additive white Gaussian noise (AWGN) channel with bandwidth W and onesided noise spectral level N0, the minimum ...
متن کاملOptimal Codes for the Burst Erasure Channel
We make the simple observation that the erasure burst correction capability of any (n, k) code can be extended to arbitrary lengths above n with the use of a block interleaver, and discuss nuances of this property when channel symbols are over GF(p) and the code is defined over GF(p ), J > 1. The results imply that maximum distance separable codes (e.g., Reed-Solomon) offer optimal burst erasur...
متن کاملSoftware-Based Erasure Codes for Scalable Distributed Storage
This paper presents a new class of erasure codes, Lincoln Erasure codes (LEC), applicable to large-scale distributed storage that includes thousands of disks attached to multiple networks. A high-performance software implementation that demonstrates the capability to meet these anticipated requirements is described. A framework for evaluation of candidate codes was developed to support in-depth...
متن کاملAccumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity
The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with bounded complexity per information bit. It also introduces symmetry properties which play a central role in the construction of capacity-achieving ensembles for the BEC. The results here improve on the tradeoff between performance and complexi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2021
ISSN: 2079-9292
DOI: 10.3390/electronics10020126